Improvement of Real-Time Job Completion Using Residual Time-Based (RTB) Scheduling

نویسندگان

  • Sarah Tasneem
  • Reda A. Ammar
  • Lester Lipsky
  • Howard A. Sholl
چکیده

AbstractRealtime multi-process scheduling is commonly used in many control situations, where it is important to achieve job completions within specific time intervals. This paper investigates the potential improvement that might be achieved when additional information (notably the residual computing time of each process) is used in the scheduling process. First, a simulation study was completed in order to demonstrate the potential benefit of the approach. The results, over many alternative job processing time distributions, clearly show a significant benefit. Second, by using a discrete distribution as a representation/approximation of each job’s distribution, a technique is developed to achieve similar beneficial results using a practical, and time cost efficient scheduler. The discrete distributions can be derived from the computation structures for each process. The results show that the approach can be effective in real time scheduling situations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption

This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Comput. Appl.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010